MPI-FAUN: An MPI-Based Framework for Alternating-Updating Nonnegative Matrix Factorization
نویسندگان
چکیده
منابع مشابه
IEE E P ro of 1 MPI - FAUN : An MPI - Based Framework 2 for Alternating - Updating Nonnegative
5 Abstract—Non-negative matrix factorization (NMF) is the problem of determining two non-negative low rank factorsW andH, for the 6 given input matrix A, such thatA WH. NMF is a useful tool for many applications in different domains such as topic modeling in text 7 mining, background separation in video analysis, and community detection in social networks. Despite its popularity in the data min...
متن کاملA Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem. At each step of ALS algorithms two convex least square problems should be solved, which causes high com...
متن کاملAn Alternating Direction Algorithm for Nonnegative Matrix Factorization
We extend the classic alternating direction method for convex optimization to solving the non-convex, nonnegative matrix factorization problem and conduct several carefully designed numerical experiments to compare the proposed algorithms with the most widely used two algorithms for solving this problem. In addition, the proposed algorithm is also briefly compared with two other more recent alg...
متن کاملApproximate Nonnegative Matrix Factorization via Alternating Minimization
In this paper we consider the Nonnegative Matrix Factorization (NMF) problem: given an (elementwise) nonnegative matrix V ∈ R + find, for assigned k, nonnegative matrices W ∈ R + and H ∈ R k×n + such that V = WH . Exact, non trivial, nonnegative factorizations do not always exist, hence it is interesting to pose the approximate NMF problem. The criterion which is commonly employed is I-divergen...
متن کاملAlternating proximal gradient method for nonnegative matrix factorization
Nonnegative matrix factorization has been widely applied in face recognition, text mining, as well as spectral analysis. This paper proposes an alternating proximal gradient method for solving this problem. With a uniformly positive lower bound assumption on the iterates, any limit point can be proved to satisfy the first-order optimality conditions. A Nesterov-type extrapolation technique is t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2018
ISSN: 1041-4347
DOI: 10.1109/tkde.2017.2767592